Adaptive Distance Measures for Resolving K2P Quartets: Metric Separation versus Stochastic Noise

نویسندگان

  • Ilan Gronau
  • Shlomo Moran
  • Irad Yavneh
چکیده

Distance-based phylogenetic reconstruction methods use the evolutionary distances between species in order to reconstruct the tree spanning them. The evolutionary distance between two species, which is computed from their DNA (or protein) sequences, is typically considered as a fixed function of these sequences, predetermined by the assumed model of evolution. This article continues the line of research that attempts to adjust to each given set of input sequences a distance function which maximizes the expected accuracy of the reconstructed tree. Specifically, we present methods for selecting distance functions that considerably improve the accuracy of quartets constructed by the four-point method in Kimura's 2-parameter model, where special emphasis is given to the case of non-homogenous quartets.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Effective Approach for Robust Metric Learning in the Presence of Label Noise

Many algorithms in machine learning, pattern recognition, and data mining are based on a similarity/distance measure. For example, the kNN classifier and clustering algorithms such as k-means require a similarity/distance function. Also, in Content-Based Information Retrieval (CBIR) systems, we need to rank the retrieved objects based on the similarity to the query. As generic measures such as ...

متن کامل

A CHARACTERIZATION FOR METRIC TWO-DIMENSIONAL GRAPHS AND THEIR ENUMERATION

‎The textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$‎. ‎In this case‎, ‎$B$ is called a textit{metric basis} for $G$‎. ‎The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$‎. ‎Givi...

متن کامل

Stochastic analysis of two adjacent structures subjected to structural pounding under earthquake excitation

Seismic pounding occurs as a result of lateral vibration and insufficient separation distance between two adjacent structures during earthquake excitation. This research aims to evaluate the stochastic behavior of adjacent structures with equal heights under earthquake-induced pounding. For this purpose, many stochastic analyses through comprehensive numerical simulations are carried out. About...

متن کامل

The metric dimension and girth of graphs

A set $Wsubseteq V(G)$ is called a resolving set for $G$, if for each two distinct vertices $u,vin V(G)$ there exists $win W$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum cardinality of a resolving set for $G$ is called the metric dimension of $G$, and denoted by $dim(G)$. In this paper, it is proved that in a connected graph $...

متن کامل

Adaptive String Distance Measures for Bilingual Dialect Lexicon Induction

This paper compares different measures of graphemic similarity applied to the task of bilingual lexicon induction between a Swiss German dialect and Standard German. The measures have been adapted to this particular language pair by training stochastic transducers with the ExpectationMaximisation algorithm or by using handmade transduction rules. These adaptive metrics show up to 11% F-measure ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Journal of computational biology : a journal of computational molecular cell biology

دوره 17 11  شماره 

صفحات  -

تاریخ انتشار 2010